Parallel Processing Letters Zero-one Sorting on the Mesh

The Pairwise Sorting Network

A new sorting network with exactly the same size and depth as the odd-even sorting network is presented. This sorting network is designed using the zero-one principle, and proceeds by first sorting pairs of bits and sorting the pairs into lexicographic order.

A Comparison of Meshes with Static Buses and Half-Duplex Wrap-Arounds

We investigate the relative computational powers of a mesh with static buses and a mesh with half-duplex wrap-arounds. The latter model is like a torus, except that any wrap-around link of the architecture can only transmit data in one of the two directions at any clock tick. We show that the permutation routing problem can be solved as efficiently on a linear array augmented with a half-duplex...

Scalability of Parallel Sorting on Mesh Multicomputers

This paper presents two new parallel algorithms QSP1 and QSP2 based on sequential quicksort for sorting data on a mesh multicomputer, and analyzes their scalability using the isoeeciency metric. We show that QSP2 matches the lower bound on the isoee-ciency function for mesh multicomputers. The isoef-ciency of QSP1 is also fairly close to optimal. Lang et al. and Schnorr et al. have developed pa...

A Cost Optimal Parallel Algorithm for Patience Sorting

A Note on Coarse Grained Parallel Integer Sorting

We observe that for n/p ≥ p, which is usually the case in practice, there exists a very simple, deterministic, optimal coarse grained parallel integer sorting algorithm with 24 communication rounds (6 n p -relations and 18 p-relations), O(n/p) memory per processor and O(n/p) local computation.